Capacity allocation in generalized Jackson networks

Node generation and capacity reallocation in open Jackson networks

IMRY ROSENBAUM1, IRAD BEN-GAL2,* and URI YECHIALI3,4 1Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, USA 2Department of Industrial Engineering, Tel-Aviv University, Ramat-Aviv, Tel Aviv, 69978, Israel E-mail: [email protected] 3Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv, 69978, Israel 4Afeka College of Engineering, ...

Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic

In a recent paper [5] it was shown that under suitable conditions stationary distributions of the (scaled) queue lengths process for a generalized Jackson network converge to the stationary distribution of the associated reflected Brownian motion in the heavy traffic limit. The proof relied on certain exponential integrability assumptions on the primitives of the network. In this note we provid...

Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks

In heavy traffic analysis of open queueing networks, processes of interest such as queue lengths and workload levels are generally approximated by a multidimensional reflected Brownian motion (RBM). Decomposition approximations, on the other hand, typically analyze stations in the network separately, treating each as a single queue with adjusted interarrival time distribution. We present a hybr...

CLAMP: differentiated capacity allocation in access networks

This paper presents a solution for providing differentiated capacity allocation in an access network. The system is based on CLAMP, an algorithm that can differentiate between flows sharing the same FIFO queue. The system is suitable for small access networks, such as those based on DSL and HFC modems and wireless LAN access points. The deployment of CLAMP is completely contained within the acc...

Capacity Allocation in Wireless Communication Networks